// Source : https://leetcode.com/problems/remove-duplicates-from-sorted-array
// Author : Dean Shi
// Date   : 2017-03-04

/***************************************************************************************
 *
 * Given a sorted array, remove the duplicates in place such that each element appear
 * only once and return the new length.
 *
 * Do not allocate extra space for another array, you must do this in place with
 * constant memory.
 *
 * For example,
 * Given input array nums = [1,1,2],
 *
 * Your function should return length = 2, with the first two elements of nums being 1
 * and 2 respectively. It doesn't matter what you leave beyond the new length.
 *
 *
 ***************************************************************************************/

/**
 * @param {number[]} nums
 * @return {number}
 */
var removeDuplicates = function(nums) {
    let pointer = 0

    for (let i = 1; i < nums.length; i++) {
        if (nums[pointer] !== nums[i]) {
            nums[++pointer] = nums[i]
        }
    }
    return nums.length ? pointer + 1 : 0
};
